Improving LSA-based Summarization with Anaphora Resolution

نویسندگان

  • Josef Steinberger
  • Mijail Alexandrov Kabadjov
  • Massimo Poesio
  • Olivia Sanchez-Graillet
چکیده

We propose an approach to summarization exploiting both lexical information and the output of an automatic anaphoric resolver, and using Singular Value Decomposition (SVD) to identify the main terms. We demonstrate that adding anaphoric information results in significant performance improvements over a previously developed system, in which only lexical terms are used as the input to SVD. However, we also show that how anaphoric information is used is crucial: whereas using this information to add new terms does result in improved performance, simple substitution makes the performance worse.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Task-Based Evaluation of Anaphora Resolution: The Case of Summarization

One of the types of semantic interpretation processes that may help ‘crossing the barriers’ in text summarization is anaphora resolution. In this paper, we show that summarization is a good task for evaluating the performance of an anaphoric resolver, in the sense that it encourages developing anaphoric resolvers that build good-quality discourse models, and the performance of the anaphoric res...

متن کامل

Two uses of anaphora resolution in summarization

We propose a new method for using anaphoric information in Latent Semantic Analysis (lsa), and discuss its application to develop an lsa-based summarizer which achieves a significantly better performance than a system not using anaphoric information, and a better performance by the rouge measure than all but one of the single-document summarizers participating in duc-2002. Anaphoric information...

متن کامل

Using Latent Semantic Analysis for Pronominal Anaphora Resolution

This report presents a pronominal anaphora resolution algorithm that uses lexical knowledge (a.k.a. world knowledge) in the process of resolution. We use Latent Semantic Analysis (LSA) as the implementation of lexical knowledge. The algorithm is fully implemented and an automatic checking procedure is applied to assess its performance. We compare it to two other algorithms: a baseline algorithm...

متن کامل

A Hybrid Approach to Pronominal Anaphora Resolution in Arabic

Corresponding Author: Abdullatif Abolohom Department of Computer Science, Faculty of Information Science and Technology, University Kebangsaan Malaysia, 43600 Bangi, Selangor, Malaysia Email: [email protected] Abstract: One of the challenges in natural language processing is to determine which pronouns to be referred to their intended referents in the discourse. Performing anaphora resolution ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005